COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	A01  Not All Languages are FMLs
C00007 ENDMK
C⊗;
A01  Not All Languages are FMLs
A02  A context-free grammar (CFG) 
A03  Earley's Algorithm for Context-Free Language Recognition and Parsing
A04  Transitivity is not a decidable property of recursive relations.
A05  Unsolvability of Formal Language Problems
A06  A function .. from sets to sets is monotone if
A07  Quantifiers, Universal and Existential.
A08  The Partition Theorem
A09  To ``standardize'' a PDA, constructed as a flowchart 
A10  Theorem. There are inherently ambiguous context-free languages.
A11  Regular Expressions for FALs
A12  midterm and final for Spring 1984
A13  String Axioms.
A14  The natural numbers are defined by:
A15  Cartesian Products and Ordered Pairs.

A17  A Sufficiency of Fallacies.
A18  An Example of an Epsilon-Delta Proof
A19  Congruence modulo $m$.
A20  Exercise: Show the following are equivalent for deterministic finite
     automata:
A21  (2) Exercise: In the graph with nodes .. the edges, labeled, are:
A22  Exercise: In the regular expression .. number of paths 
A23  [Subject: Pairing functions, sequences.]
A24  Proofs by induction about summations of polynomial functions,
A25  If C is a class of machines (e.g., deterministic machines with finitely
A26  Theorem: Any (partial) function that can be computed
A27  A context-free grammar (CFG) G is a system for defining a language
A28  Greibach's Theorem

A30  Given a DFA, to test strings, x and y for prefix equivalence.
A31  Midterm solutions.
A32  Equivalence and Minimization of Deterministic Finite Automata
A33  set functions
A34  Ogden's Pumping $uvwxy$ Theorem
A35  Semigroups.
A36  Primitive Roots.
A37  Moore machine:
A38  If L is a language over .. ,  two equivalence relations
A39  The Relation Between Stacks and Parentheses
A40  Context-free Languages as Fixed Points
A41  Midterm Spring 1986
A42  Homework Solution. See Hopcroft and Ullman, Ex.~3.20.
A43  Solution to Hopcroft and Ullman, Exercise 1.4 (Revised).
A44  Midterm With Some Solutions .. Spring 1986
A45  Ambiguity
A46  Pairing Functions 
A47  Rice's Theorem 
A48  Factoring Input-Output Relations 
A49  Homorphisms
A50  Proofs for Takehome Final, CS 254, Spring 1985--86
A51  Solutions to some takehome final problems
A52  Homework - CS 254 - to be exercises or examples.
A53  PROBLEMS FOR THE FORMAL LANGUAGE BOOK
A54  Final Exam -- Part I. June 10, 1986
A55  Final Exam -- Part I. Closed book. Autumn 1984
A56  The Hennie-Stearns Theorem
A57  Transitive Closures
A58  Kleene's Theorem and Digraphs
A59  Finite Fields and Primitive Roots
A60  The First-order Calculus is Undecidable --- Short Proof
A61  Primitive Recursion
A62  Fixed Point Theory
A63  Machines and Computations
A64  Nondeterministic Machines
A65  Determinacy -- Preserving Composition
A66  Chapter 2: Definition of machine, standardize, simulate, ...
A67  Standardizing a finite machine
A68  Equivalence in Languages